Lyndon Words and Singular Factors of Sturmian Words
نویسنده
چکیده
Two diierent factorizations of the Fibonacci innnite word were given independently in 10] and 6]. In a certain sense, these factorizations reveal a self-similarity property of the Fibonacci word. We rst describe the intimate links between these two factorizations. We then propose a generalization to characteristic sturmian words. R esum e. Deux factorisations du mot de Fibonacci ont et e donn ees dans deux articles ind ependants, 10] et 6]. Ces factorisations d ecrivent, d'une certaine mani ere, une propri et e d'auto-similarit e du mot de Fibonacci. Nous d ecrivons d'abord les liens etroits entre ces deux factorisations. Puis nous proposons une g en eralisation aux mots sturmiens caract eristiques.
منابع مشابه
Conjugacy of morphisms and Lyndon decomposition of standard Sturmian words
Words 2005-Conjugacy of morphisms and Lyndon decomposition of standard Sturmian words – p.1/11
متن کاملQuasiperiodic and Lyndon episturmian words
Recently the second two authors characterized quasiperiodic Sturmian words, proving that a Sturmian word is non-quasiperiodic if and only if it is an infinite Lyndon word. Here we extend this study to episturmian words (a natural generalization of Sturmian words) by describing all the quasiperiods of an episturmian word, which yields a characterization of quasiperiodic episturmian words in term...
متن کاملRecent Results in Sturmian Words1
In this survey paper, we present some recent results concerning nite and innnite Stur-mian words. We emphasize on the diierent deenitions of Sturmian words, and various subclasses, and give the ways to construct them related to continued fraction expansion. Next, we give properties of special nite Sturmian words, called standard words. Among these, a decomposition into palindromes, a relation w...
متن کاملQuasiperiodic Sturmian words and morphisms
We characterize all quasiperiodic Sturmian words: a Sturmian word is not quasiperiodic if and only if it is a Lyndon word. Moreover, we study links between Sturmian morphisms and quasiperiodicity.
متن کاملCounting Lyndon Factors
In this paper, we determine the maximum number of distinct Lyndon factors that a word of length n can contain. We also derive formulas for the expected total number of Lyndon factors in a word of length n on an alphabet of size σ, as well as the expected number of distinct Lyndon factors in such a word. The minimum number of distinct Lyndon factors in a word of length n is 1 and the minimum tot...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 218 شماره
صفحات -
تاریخ انتشار 1999